h=[]
m=[]
for _ in range(2):
x,y = list(map(int, input().split(':')))
h.append(x)
m.append(y)
h[0]=h[0]-h[1]
m[0]=m[0]-m[1]
if m[0]<0:
h[0]-=1
m[0]+=60
if h[0]<0:
h[0]+=24
if h[0]>=0 and h[0]<=9:
h[0]='0'+str(h[0])
if m[0]>=0 and m[0]<=9:
m[0]='0'+str(m[0])
print(f"{h[0]}:{m[0]}")#include <cstdio>
int main() {
int h[2], m[2];
for(int i = 0; i < 2; i++)
scanf("%d:%d", &h[i], &m[i]);
h[0] -= h[1];
m[0] -= m[1];
if (m[0] < 0)
m[0] += 60, h[0]--;
if (h[0] < 0)
h[0] += 24;
printf("%02d:%02d\n", h[0], m[0]);
return 0;
}1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |